Incremental column-wise verification of arithmetic circuits using computer algebra
نویسندگان
چکیده
منابع مشابه
Challenges in Verifying Arithmetic Circuits Using Computer Algebra
Verifying arithmetic circuits is an important problem which still requires considerable manual effort. For instance multipliers are considered difficult to verify. The currently most effective approach for arithmetic circuit verification uses computer algebra. In this approach the circuit is modeled as a set of pseudo-boolean polynomials and it is checked if the given word-level specification i...
متن کاملAutomatic Verification of Arithmetic Circuits using Step-wise Refinement of Term Rewriting Systems
This paper presents a novel technique for proving the correctness of arithmetic circuit designs described at the Register Transfer Level (RTL). The technique begins with the automatic translation of circuits from a Verilog RTL description into a Term Rewriting System (TRS). We prove the correctness of the designs via an equivalence proof between TRSs for the implementation circuit design and a ...
متن کاملAutomated Debugging of Arithmetic Circuits Using Incremental Gröbner Basis Reduction
Symbolic algebra is a promising approach to verify large and complex arithmetic circuits. Existing algebraic-based verification methods generate a remainder to indicate buggy implementation. The remainder is beneficial for debugging of the faulty implementation since it can be used for automated test generation, bug localization, and bug correction. However, existing equivalence checking approa...
متن کاملA Formal Approach to Designing Arithmetic Circuits over Galois Fields Using Symbolic Computer Algebra
This paper proposes a formal approach to designing arithmetic circuits over Galois Fields (GFs). Our method represents a GF arithmetic circuit by a hierarchical graph structure specified by variables and arithmetic formulae over GFs. The proposed circuit description is applicable to anyGF (p) (p ≥ 2) arithmetic and is formally verified by symbolic computation techniques such as polynomial reduc...
متن کاملFunction Verification of Combinational Arithmetic Circuits
FUNCTION VERIFICATION OF COMBINATIONAL ARITHMETIC CIRCUIT MAY 2015 DUO LIU B.S., JIANGNAN UNIVERSITY, WUXI, JIANGSU, CHINA M.S.E.C.E., UNIVERSITY OF MASSACHUSETTS AMHERST Directed by: Professor Maciej Ciesielski Hardware design verification is the most challenging part in overall hardware design process. It is because design size and complexity are growing very fast while the requirement for pe...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Formal Methods in System Design
سال: 2019
ISSN: 0925-9856,1572-8102
DOI: 10.1007/s10703-018-00329-2